Computer Science Technical Report A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
نویسندگان
چکیده
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4.
منابع مشابه
Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"
Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed.
متن کاملComputer Science Technical Report Fault Tolerant Ring Embedding in Tetravalent Cayley Network Graphs
Our purpose in the present paper is to investigate the structural properties of the newly proposed Cayley networks of constant node degree 4. We show that the graph contains rings of maximal length in presence of multiple faults. Our results provide further evidence to the usefulness and robustness of these network graphs.
متن کاملCayley graph connected cycles: A new class of fixed-degree interconnection networks
We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles , which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertexsymmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in ...
متن کاملCyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
We introduce a new family of interconnection networks that are Cayley graphs with xed degrees of any even number greater than or equal to 4. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can have ...
متن کاملRepresentations and Routing for Cayley Graphs
In the search for regular, undirected dense graphs for interconnection networks, Chudnovsky et al. found certain Cayley graphs that are the densest degree-four graphs known for an interesting range of diameters [l]. However, the group theoretic representation of Cayley graphs makes the development of effective routing algorithms difficult. This paper shows that all finite Cayley graphs can be r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995